On convex hyperbolic regions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyperbolic manifolds with convex boundary

Let (M,∂M) be a 3-manifold, which carries a hyperbolic metric with convex boundary. We consider the hyperbolic metrics on M such that the boundary is smooth and strictly convex. We show that the induced metrics on the boundary are exactly the metrics with curvature K > −1, and that the third fundamental forms of ∂M are exactly the metrics with curvature K < 1, for which closed geodesics which a...

متن کامل

Domains with Convex Hyperbolic Radius

The hyperbolic radius of a domain on the Riemann sphere is equal to the reciprocal of the density of the hyperbolic metric. In the present paper, it is proved that the hyperbolic radius is a convex function if and only if the complement of the domain is a convex set.

متن کامل

Hyperbolic Polynomials and Convex Analysis

A homogeneous real polynomial p is hyperbolic with respect to a given vector d if the univariate polynomial t → p(x − td) has all real roots for all vectors x. Motivated by partial differential equations, Gårding proved in 1951 that the largest such root is a convex function of x, and showed various ways of constructing new hyperbolic polynomials. We present a powerful new such construction, an...

متن کامل

On optimal bridges between two convex regions

Given k disjoint regions in the plane or space, the bridge problem asks for k − 1 line segments (optimal bridges) which connect these regions so as to minimize the length of the longest path between two points in the final connected region. We present O(n) and O(n2) time algorithms for finding an optimal bridge between two convex regions in the plane and space, respectively. An important proper...

متن کامل

Traversing non-convex regions

This paper considers a method for dealing with non-convex objective functions in optimization problems. It uses the Hessian matrix and combines features of trust-region techniques and continuous steepest descent trajectory-following in order to construct an algorithm which performs curvilinear searches away from the starting point of each iteration. A prototype implementation yields promising r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Japanese journal of mathematics. New series

سال: 1997

ISSN: 0289-2316,1861-3624

DOI: 10.4099/math1924.23.157